Optimal path cover problem on block graphs and bipartite permutation graphs
نویسندگان
چکیده
منابع مشابه
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs
The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. Finding an optimal path cover for an arbitrary graph is known to be NP-complete [3]. However, polynornial-time algorithms exist for trees [4], cacti [4] and for interval graphs [9]. The solution presented in [2] For circular-arc graphs is known to be wrong. In ...
متن کاملThe Longest Path Problem on Permutation Graphs
The longest path problem on graph G is a classic problem which is to find a simple path such that the number of vertices of the path is maximum among all possible paths of G. In this paper, we show that the longest path problem can be solved in linear time on permutation graphs.
متن کاملOn opposition graphs, coalition graphs, and bipartite permutation graphs
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition graphs have been introduced and investigated in connection to perfect graphs. Recognizing and characterizing opposition and coalition graphs still remain lon...
متن کاملBipartite permutation graphs
Bipartite graphs and permutation graphs are two well known subfamilies of the perfect graphs. Neither of these families is contained in the other, and their intersection is nonempty. This paper shows that graphs which are both bipartite and permutation graphs have good algorithmic properties. These graphs can be recognized in linear time, and several problems which are NP-complete or of unknown...
متن کاملEdge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs
An edge dominating set D of graph G = (V; E) is a set of edges such that every edge not in D is adjacent to at least an edge in D. In this paper we develop polynomial time algorithms for nding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90123-b